Exploitation of 2D binary source correlation using turbo block codes with fine-tuning

نویسندگان

  • Mohd Azri Mohd Izhar
  • Norsheila Fisal
  • Xiaobo Zhou
  • Khoirul Anwar
  • Tadashi Matsumoto
چکیده

This article proposes a joint source-channel coding technique for two-dimensional (2D) binary Markov sources by using concatenated turbo block codes composed of two Bose, Chaudhuri, Hocquenghem (BCH) codes, of which output is followed by a rate-1 recursive systematic convolutional code. The source correlation of all rows and columns of the 2D source is well exploited by using a modified Bahl–Cocke–Jelinek–Raviv (BCJR) algorithm for the decoding of the BCH codes. Simulation results show that the proposed technique outperforms in terms of bit error rate the codes that exploits one-dimensional (1D) source correlation using the modified BCJR algorithm, and obviously the conventional system without source correlation exploitation. In order to further improve the performance, this article aims to make fine-tuning of the code parameters, given the source correlation property, that can achieve performance even closer to the theoretical limit than without the fine-tuning. Finally, results of image transmission simulations using two images, one having strong and the other weak 2D correlation, are presented to demonstrate the effectiveness of our proposed technique.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algebraic approach to source coding with side information using list decoding

Existing literature on source coding with side information (SCSI) mostly uses the state-ofthe-art channel codes namely LDPC codes, turbo codes, and their variants and assume classical unique decoding. In this paper, we present an algebraic approach to SCSI based on the list decoding of the underlying channel codes. We show that the theoretical limit of SCSI can be achieved in the proposed list ...

متن کامل

Iterative Source-Channel Decoding: Design of Redundant Index Assignments

The exploitation of the residual redundancy of source codec parameters by using the Turbo principle is known as iterative source-channel decoding (ISCD). The concept of redundant index assignments was proposed as a powerful improvement for ISCD. In this contribution design and optimization guidelines for such redundant index assignments are presented. Commonly, the redundant index assignment is...

متن کامل

The turbo-fountain

Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalisation for fountain codes operating on erasure channels, and we generalise the problem formalisation to more general channels. We introduce a novel type of rateless codes based on the Turbo Principle: the Turbo-Fountain. The Turbo-Fountain is able to consi...

متن کامل

Joint source-channel coding of binary sources with side information at the decoder using IRA codes

We use systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the decoder. A special case of this problem is joint source-channel coding for a nonequiprobable memoryless binary source. The theoretical limits of this problem are given by combining the Slepian-Wolf theorem, the source ent...

متن کامل

Study of Turbo Codes and Decoding in Binary Erasure Channel Based on Stopping Set Analysis

In this paper, we define a stopping set of turbo codes with the iterative decoding in the binary erasure channel. Based on the stopping set analysis, we study the block and bit erasure probabilities of turbo codes and the performance degradation of the iterative decoding against the maximum-likelihood decoding. The error floor performance of turbo codes with the iterative decoding is dominated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • EURASIP J. Wireless Comm. and Networking

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013